Tree-like Properties of Cycle Factorizations
نویسندگان
چکیده
منابع مشابه
Tree-like Properties of Cycle Factorizations
We provide a bijection between the set of factorizations, that is, ordered (n− 1)-tuples of transpositions in Sn whose product is (12...n), and labelled trees on n vertices. We prove a refinement of a theorem of Dénes [3] that establishes new tree-like properties of factorizations. In particular, we show that a certain class of transpositions of a factorization correspond naturally under our bi...
متن کاملThe Properties of Tree-Like Hierarchical Networks
Tree-like hierarchical structure is one of the key features in many real complex systems. To investigate its properties, a deterministic tree-like hierarchical network model is proposed. Next, the static properties of the tree-like hierarchical networks are discussed. The simulation and theoretical results prove that the artificial tree-like networks conformably possess small-world and scalefre...
متن کاملFactorizations of properties of graphs
A property of graphs is any isomorphism closed class of simple graphs. For given properties of graphs P1,P2, . . . ,Pn a vertex (P1,P2, . . . ,Pn)-partition of a graph G is a partition {V1, V2, . . . , Vn} of V (G) such that for each i = 1, 2, . . . , n the induced subgraph G[Vi] has property Pi. The class of all graphs having a vertex (P1,P2, . . . ,Pn)partition is denoted by P1◦P2◦ · · · ◦Pn....
متن کاملFactorizations of some weighted spanning tree enumerators
We give factorizations for weighted spanning tree enumerators of Cartesian products of complete graphs, keeping track of fine weights related to degree sequences and edge directions. Our methods combine Kirchhoff’s Matrix-Tree Theorem with the technique of identification of factors.
متن کاملDeterminization of Weighted Tree Automata Using Factorizations
We present a determinization construction for weighted tree automata using factorizations. Among others, this result subsumes a previous result for determinization of weighted string automata using factorizations (Kirsten and Mäurer, 2005) and two previous results for weighted tree automata, one of them not using factorizations (Borchardt, 2004) and one of them restricted to nonrecursive automa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2002
ISSN: 0097-3165
DOI: 10.1006/jcta.2001.3230